The forcing number of graphs with given girth
نویسندگان
چکیده
منابع مشابه
Lucky Choice Number of Planar Graphs with Given Girth
Suppose the vertices of a graph G are labeled with real numbers. For each vertex v ∈ G, let S(v) denote the sum of the labels of all vertices adjacent to v. A labeling is called lucky if S(u) 6= S(v) for every pair u and v of adjacent vertices in G. The least integer k for which a graph G has a lucky labeling from {1, 2, . . . , k} is called the lucky number of the graph, denoted η(G). In 2009,...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملConnectivity of graphs with given girth pair
Girth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. Graph Theory 7 (1983) 209–218]. The odd girth (even girth) of a graph is the length of a shortest odd (even) cycle. Let g denote the smaller of the odd and even girths, and let h denote the larger. Then (g, h) is called the girth pair of the graph. In this paper we prove that a graph with girth pair (g, h...
متن کاملRegular Graphs of given Girth
Graph theory is the study of mathematical structures called graphs. We define a graph as a pair (V,E), where V is a nonempty set, and E is a set of unordered pairs of elements of V . V is called the set of vertices of G, and E is the set of edges. Two vertices a and b are adjacent provided (a, b) ∈ E. If a pair of vertices is adjacent, the vertices are referred to as neighbors. We can represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quaestiones Mathematicae
سال: 2017
ISSN: 1607-3606,1727-933X
DOI: 10.2989/16073606.2017.1376230